injection into orbit optimization using orthogonal polynomialsinjection into orbit optimization using orthogonal polynomials

نویسندگان

sedigheh shahmirzaee jeshvaghany department of mechanical and aerospace engineering, science and research branch, islamic azad university, tehran, iran

farshad pazooki department of mechanical and aerospace engineering, science and research branch, islamic azad university, tehran, iran.

alireza basohbat novinzaddeh department of aerospace engineering, k.n.toosi university of technology, tehran, iran

چکیده

in this study, the problem of determining an optimal trajectory of a nonlinear injection into orbit problem with minimum time was investigated. the method was based on orthogonal polynomial approximation. this method consists of reducing the optimal control problem to a system of algebraic equations by expanding the state and control vector as chebyshev or legendre polynomials with undetermined coefficients. the main characteristic of this technique was that it converted the differential expressions arising from the system dynamics and the performance index into some nonlinear algebraic equations, thereby greatly simplifies the problem solution. our research effort focuses on applying a chebyshev series expansion to optimize the trajectory profile of a point-mass satellite launch vehicle (slv).this paper is divided as follows: first, the chebyshev and legender series expansion to optimization are introduced. then, the flight mechanics model of the point-mass slv is given. next, our optimization problem is described and optimization results are presented and discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orbit Learning using Convex Optimization

Recently, learning approaches have been brought to bear on nonlinear datasets by assuming samples lie on a low-dimensional Riemannian manifold in the embedding space. One solution is to model local variations linearly [1]. A fundamental difficulty with such solutions is they cannot extrapolate or generalize far from the training data when the manifold is curved. Consequently, the manifold needs...

متن کامل

Solving singular integral equations by using orthogonal polynomials

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

متن کامل

Orthogonal Projection Pursuit Using Genetic Optimization

Projection pursuit is concerned with finding interesting lowdimensional subspace of multivariate data. In this paper we proposed a genetic optimization approach to find the globally optimal orthogonal subspace given training data and user defined criterion on what subspaces are interesting. We then applied this approach to human face recognition. Suppose face recognition is done by simple corre...

متن کامل

Continuum discretization using orthogonal polynomials

A method for discretizing the continuum by using a transformed harmonic oscillator basis has recently been presented @Phys. Rev. A 63, 052111 ~2001!#. In the present paper, we propose a generalization of that formalism which does not rely on the harmonic oscillator for the inclusion of the continuum in the study of weakly bound systems. In particular, we construct wave functions that represent ...

متن کامل

Low-Thrust Orbit Transfer Optimization using a Combined Method

A genetic algorithm is used together with calculus of variations to optimize an interplanetary trajectory for the Bryson-Ho Earth-to-Mars orbit transfer problem. The global search properties of genetic algorithm combine with the local search capabilities of calculus of variations to produce solutions that are superior to those generated with the calculus of variations alone, and these solutions...

متن کامل

Low-thrust Orbit Transfer Optimization Using Genetic Search

Most techniques for solving dynamic optimization problems involve a series of gradient computations and one-dimensional searches at some point in the optimization process. A large class of problems, however, does not possess the necessary smoothness properties that such algorithms require for good convergence. Even when smoothness conditions are met, poor initial guesses at the solution often r...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of advanced design and manufacturing technology

جلد ۹، شماره ۳، صفحات ۰-۰

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023